Solve the following Linear Programming Problem graphically:
Minimise $Z = x + 2y$
subject to the constraints:
$2x + y \geq 3$
$x + 2y \geq 6$
$x, y \geq 0$

  • A
    $3$
  • B
    $6$
  • C
    $9$
  • D
    $12$

Explore More

Similar Questions

The corner points of the feasible region determined by the system of linear constraints are $(0, 10)$, $(5, 5)$, $(15, 15)$, and $(0, 20)$. Let $z = px + qy$ where $p, q > 0$. The condition on $p$ and $q$ such that the maximum value of $z$ occurs at both points $(15, 15)$ and $(0, 20)$ is

$A$ fruit grower can use two types of fertilizer in his garden,brand $P$ and brand $Q$. The amounts (in $kg$) of nitrogen,phosphoric acid,potash,and chlorine in a bag of each brand are given in the table. Tests indicate that the garden needs at least $240\,kg$ of phosphoric acid,at least $270\,kg$ of potash and at most $310\,kg$ of chlorine. If the grower wants to minimize the amount of nitrogen added to the garden,how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden (in $,kg$)?
Brand $P$ ($kg$ per bag)Brand $Q$ ($kg$ per bag)
Nitrogen$3$$3.5$
Phosphoric acid$1$$2$
Potash$3$$1.5$
Chlorine$1.5$$2$

Difficult
View Solution

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

Maximize $Z=3x+4y$,subject to the constraints: $x+y \leq 1, x \geq 0, y \geq 0$.

For the $LP$ problem,"Maximize $z = x + 4y$ subject to $3x + 6y \leq 6$,$4x + 8y \geq 16$ and $x \geq 0, y \geq 0$."

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo